Fast decoding of binary quadratic residue codes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding of the Five-Error-Correcting Binary Quadratic Residue Codes

In this paper, a new efficient syndrome-weight decoding algorithm (NESWDA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of NESWDA is based on the property cyclic codes together with the weight of syndrome difference. The advantage of the NESWDA decoding algorithm over the previous table look-up methods is that i...

متن کامل

Decoding of the Triple-Error-Correcting Binary Quadratic Residue Codes

In this paper, a more efficient syndrome-weight decoding algorithm (SWDA), called the enhanced syndrome-weight decoding algorithm (ESWDA), is presented to decode up to three possible errors for the binary systematic (23, 12, 7) and (31, 16, 7) quadratic residue (QR) codes. In decoding of the QR codes, the evaluation of the error-locator polynomial in the finite field is complicated and time-con...

متن کامل

Decoding Binary Quadratic Residue codes Using the Euclidean Algorithm

A simplified algorithm for decoding binary quadratic residue (QR) codes is developed in this paper. The key idea is to use the efficient Euclidean algorithm to determine the greatest common divisor of two specific polynomials which can be shown to be the error-locator polynomial. This proposed technique differs from the previous schemes developed for QR codes. It is especially simple due to the...

متن کامل

Fast algorithm for decoding of systematic quadratic residue codes

A general algorithm for decoding the binary systematic quadratic residue (QR) codes with lookup tables is presented in this study. The algorithm can be applied in decoding the QR codes with either reducible or irreducible generator polynomials. If the generator polynomial of the QR codes is reducible, the number of elements in the Galois field is less than the sum of all correctable error patte...

متن کامل

Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm

In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey algorithm. By a modification of the technique developed by He et al., one can express the unknown syndromes as functions of the known syndromes. The unknown syndromes are determined by an efficient algorithm also developed in this paper. With the appearance of unknown syndro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 2019

ISSN: 0013-5194,1350-911X

DOI: 10.1049/el.2019.2143